coin-tossing sequence

См. также в других словарях:

• Fair coin — In probability theory and statistics, a sequence of independent Bernoulli trials with probability 1/2 of success on each trial is metaphorically called a fair coin. One for which the probability is not 1/2 is called a biased or unfair coin. Fair… …   Wikipedia

• probability theory — Math., Statistics. the theory of analyzing and making statements concerning the probability of the occurrence of uncertain events. Cf. probability (def. 4). [1830 40] * * * Branch of mathematics that deals with analysis of random events.… …   Universalium

• Generalizations of Fibonacci numbers — In mathematics, the Fibonacci numbers form a sequence defined recursively by:: F (0) = 0: F (1) = 1: F ( n ) = F ( n 1) + F ( n 2), for integer n > 1.That is, after two starting values, each number is the sum of the two preceding numbers.The… …   Wikipedia

• Gambler's fallacy — The Gambler s fallacy, also known as the Monte Carlo fallacy (because its most famous example happened in a Monte Carlo Casino in 1913)[1], and also referred to as the fallacy of the maturity of chances, is the belief that if deviations from… …   Wikipedia

• Martingale (betting system) — For the generalised mathematical concept, see martingale (probability theory). Originally, martingale referred to a class of betting strategies popular in 18th century France. The simplest of these strategies was designed for a game in which the… …   Wikipedia

• Large deviations theory — In Probability Theory, the Large Deviations Theory concerns the asymptotic behaviour of remote tails of sequences of probability distributions. Some basic ideas of the theory can be tracked back to Laplace and Cramér, although a clear unified… …   Wikipedia

• Chess960 starting position — Chess960 is a chess variant in which the arrangement of pieces on the first rank is randomly generated. There are 960 possible starting positions, hence the name. The starting position can be generated before the game either by a computer program …   Wikipedia

• Optimal stopping — In mathematics, the theory of optimal stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of… …   Wikipedia

• Parrondo's paradox — is a paradox in game theory and is often described as: A losing strategy that wins . It is named after its creator Juan Parrondo, a Spanish physicist. Mathematically a more involved statement is given as:: Given two games, each with a higher… …   Wikipedia

• Randomized controlled trial — Flowchart of four phases (enrollment, intervention allocation, follow up, and data analysis) of a parallel randomized trial of two groups, modified from the CONSORT (Consolidated Standards of Reporting Trials) 2010 Statement[1] …   Wikipedia

• List of mathematics articles (F) — NOTOC F F₄ F algebra F coalgebra F distribution F divergence Fσ set F space F test F theory F. and M. Riesz theorem F1 Score Faà di Bruno s formula Face (geometry) Face configuration Face diagonal Facet (mathematics) Facetting… …   Wikipedia